Utilizing Moment Invariants and Gröbner Bases to Reason About Shapes
نویسندگان
چکیده
Shapes such as triangles or rectangles can be defined in terms of geometric properties invariant under a group of transformations. Complex shapes can be described by logic formulae w i th simpler shapes as the atoms. A standard technique for computing invariant properties of simple shapes is the method of moment invariants, known since the early sixties. We generalize this technique to shapes described by arb i t rary monotone formulae (formulae in proposit ional logic wi thout negation). Our technique produces a reduced Grobner basis for approximate shape descriptions. We show how to use this representation to solve decision problems related to shapes. Examples include determining if a figure has a particular shape, if one description of a shape is more general than another, and whether a specific geometric property is really necessary for characterizing a shape. Unlike geometry theorem proving, our approach does not require the shapes to be expl ici t ly defined. Instead, logic formulae combined w i th measurements performed on actual shape instances are used to compute well characterized least squares approximations to the shapes. Our results provide a proof that decision problems stated in terms of these approximations can be solved in a finite number of steps.
منابع مشابه
Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases
We propose a static analysis for computing polynomial invariants for imperative programs. The analysis is derived from an abstract interpretation of a backwards semantics, and computes preconditions for equalities like g = 0 to hold at the end of execution. A distinguishing feature of the technique is that it computes polynomial loop invariants without resorting to Gröbner base computations. Th...
متن کاملToric Ideals of Phylogenetic Invariants
Statistical models of evolution are algebraic varieties in the space of joint probability distributions on the leaf colorations of a phylogenetic tree. The phylogenetic invariants of a model are the polynomials which vanish on the variety. Several widely used models for biological sequences have transition matrices that can be diagonalized by means of the Fourier transform of an abelian group. ...
متن کاملar X iv : m at h / 02 10 07 9 v 1 [ m at h . A C ] 4 O ct 2 00 2 GRÖBNER BASES , LOCAL COHOMOLOGY AND REDUCTION NUMBER
D. Bayer and M. Stillman showed that Gröbner bases can be used to compute the Castelnuovo-Mumford regularity which is a measure for the vanishing of graded local cohomology modules. The aim of this paper is to show that the same method can be applied to study other cohomological invariants as well as the reduction number.
متن کاملLocal Decomposition Algorithms
INTRODUCTION For an ideal I ⊂ P := k[X 1 ,…,X n ], many algorithms using Gröbner techniques are a direct consequence of the definition itself of Gröbner basis: among them we can list algorithms for computing syzygies, dimension, minimal bases, free resolutions, Hilbert function and other algebro-geometric invariants of an ideal; the explicit knowledge of syzygies allows moreover to compute idea...
متن کاملGröbner Bases, Invariant Theory and Equivariant Dynamics
This paper is about algorithmic invariant theory as it is required within equivariant dynamical systems. The question of generic bifurcation equations (arbitrary equivariant polynomial vector) requires the knowledge of fundamental invariants and equivariants. We discuss computations which are related to this for finite groups and semi-simple Lie groups. We consider questions such as the complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Intelligence
دوره 14 شماره
صفحات -
تاریخ انتشار 1995